- Steiner tree
- дерево Штейнера; дерево минимальной суммарной длины (такое дерево соответствует маршруту с минимальным числом переприёмов)
Англо-русский словарь промышленной и научной лексики. 2014.
Steiner tree
Смотреть что такое "Steiner tree" в других словарях:
Steiner tree — The Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization.The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a… … Wikipedia
Steiner Tree — Das Steinerbaumproblem (oft mit STEINER TREE notiert), ein nach dem Schweizer Mathematiker Jakob Steiner benanntes Problem der Graphentheorie, ist eine Verallgemeinerung des Problems des minimalen Spannbaums. Beim Steinerbaumproblem sucht man in… … Deutsch Wikipedia
Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC … Wikipedia
Steiner — is a German surname that is derived from the word Stein , meaning stone. It may refer to: *Adelbert Steiner, fictional character from the video game Final Fantasy IX *Ben Steiner (1921 1988), Major League Baseball player *Cecil C. Steiner,… … Wikipedia
Steiner points — There are two uses of the term Steiner point.In graph theory and computational geometry, a Steiner point is an extra vertex that is not a member of the input. For example, see their use in the Steiner tree problem.In geometry, a Steiner point is… … Wikipedia
Jakob Steiner — Infobox Scientist name = box width = image width =150px caption = birth date = 18 March , 1796 birth place = Utzenstorf, Canton of Bern death date = April 1, 1863 death place = Bern residence = citizenship = Swiss nationality = ethnicity = field … Wikipedia
Arbre De Steiner — Pour les articles homonymes, voir Steiner. Solution pour trois points. Le point de Steiner est au centre des trois autres points (il n y a pas de connexion directe entre A … Wikipédia en Français
Arbre de steiner — Pour les articles homonymes, voir Steiner. Solution pour trois points. Le point de Steiner est au centre des trois autres points (il n y a pas de connexion directe entre A … Wikipédia en Français
Arbre de Steiner — Pour les articles homonymes, voir Steiner. Solution pour trois points. Le point de Steiner est au centre des trois autres points (il n y a pas de connexion directe entre A, B et C) … Wikipédia en Français
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Degree-constrained spanning tree — In graph theory, a degree constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree constrained spanning tree problem is to determine whether a particular graph has such a spanning … Wikipedia
